Parallel Variable Distribution for Constrained Optimization

نویسندگان

  • Claudia A. Sagastizábal
  • Mikhail V. Solodov
چکیده

In the parallel variable distribution framework for solving optimization problems (PVD), the variables are distributed among parallel processors with each processor having the primary responsibility for updating its block of variables while allowing the remaining “secondary” variables to change in a restricted fashion along some easily computable directions. For constrained nonlinear programs convergence theory for PVD algorithms was previously available only for the case of convex feasible set. Additionally, one either had to assume that constraints are block-separable, or to use exact projected gradient directions for the change of secondary variables. In this paper, we propose two new variants of PVD for the constrained case. Without assuming convexity of constraints, but assuming block-separable structure, we show that PVD subproblems can be solved inexactly by solving their quadratic programming approximations. This extends PVD to nonconvex (separable) feasible sets, and provides a constructive practical way of solving the parallel subproblems. For inseparable constraints, but assuming convexity, we develop a PVD method based on suitable approximate projected gradient directions. The approximation criterion is based on a certain error bound result, and it is readily implementable. Using such approximate directions may be especially useful when the projection operation is computationally expensive.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modified Discreet Particle Swarm Optimization for a Multi-level Emergency Supplies Distribution Network

Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...

متن کامل

On the Convergence of Constrained Parallel Variable Distribution Algorithms

We consider the parallel variable distribution (PVD) approach proposed by Ferris and Mangasarian [SIAM J. Optim., 4 (1994), pp. 815–832] for solving optimization problems. The problem variables are distributed among p processors with each processor having the primary responsibility for updating its block of variables while allowing the remaining “secondary” variables to change in a restricted f...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

Trajectory Optimization of Cable Parallel Manipulators in Point-to-Point Motion

Planning robot trajectory is a complex task that plays a significant role in design and application of robots in task space. The problem is formulated as a trajectory optimization problem which is fundamentally a constrained nonlinear optimization problem. Open-loop optimal control method is proposed as an approach for trajectory optimization of cable parallel manipulator for a given two-end-po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comp. Opt. and Appl.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2002